Discrete parallel machine makespan ScheLoc problem

Discrete parallel machine makespan ScheLoc problem

Scheduling-Location (ScheLoc) Problems integrate the separate fields of scheduling and location problems. In ScheLoc Problems the objective is to find locations for the machines and a schedule for each machine subject to some production and location constraints such that some scheduling objective is minimized. In this paper we consider the Discrete Parallel Machine Makespan (DPMM) ScheLoc Probl...

Scheduling and Location (ScheLoc): Makespan Problem with Variable Release Dates

While in classical scheduling theory the locations of machines are assumed to be fixed we will show how to tackle location and scheduling problems simultaneously. Obviously, this integrated approach enhances the modeling power of scheduling for various real-life problems. In this paper, we present in an exemplary way theory and a solution algorithm for a specific type of a scheduling and a rath...

Simulated Annealing Algorithm to Minimize Makespan in Single Machine Scheduling Problem with Uniform Parallel Machines

This paper presents a simulated annealing algorithm to minimize makespan of single machine scheduling problem with uniform parallel machines. The single machine scheduling problem with uniform parallel machines consists of n jobs, each with single operation, which are to be scheduled on m parallel machines with different speeds. Since, this scheduling problem is a combinatorial problem; usage o...

Makespan Minimization for a Parallel Machine Scheduling Problem with Preemption and Job Incompatibility

A modified LPT algorithm for the two uniform parallel machine makespan minimization problem

We propose a modified longest processing time (MLPT) heuristic algorithm for the two uniform machine makespan minimization problem. The MLPT algorithm schedules the three longest jobs optimally first, followed by the remaining jobs sequenced according to the LPT rule. We prove the tight worst-case ratio bound of ffiffiffiffiffiffi 1:5 p 1⁄4 1:2247 for the MLPT algorithm which is an improvement ...